https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 Labelings of plane graphs containing Hamilton Path https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:12213 Wed 28 Mar 2018 14:34:22 AEDT ]]> Edge irregular reflexive labeling of prisms and wheels https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:30428 G we define k-labeling ρ such that the edges of G are labeled with integers {1, 2, . . . , ke} and the vertices of G are labeled with even integers {0, 2, . . . , 2kv}, where k = max{ke, 2kv}. The labeling ρ is called an edge irregular k-labeling if distinct edges have distinct weights, where the edge weight is defined as the sum of the label of that edge and the labels of its ends. The smallest k for which such labeling exist is called the reflexive edge strength of G. In this paper we give exact values of reflexive edge strength for prisms, wheels, baskets and fans.]]> Wed 11 Apr 2018 13:07:11 AEST ]]> Totally antimagic total graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:26991 Wed 11 Apr 2018 11:44:28 AEST ]]> On edge irregular reflexive labellings for the generalized friendship graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:31129 Tue 04 Feb 2020 10:56:06 AEDT ]]> Note on super antimagicness of disconnected graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:8001 Sat 24 Mar 2018 08:42:34 AEDT ]]> Super-vertex-antimagic total labelings of disconnected graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:7866 Sat 24 Mar 2018 08:38:57 AEDT ]]> Labelings of plane graphs with determined face weights https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:6827 Sat 24 Mar 2018 07:45:42 AEDT ]]> On h-antimagicness of disconnected graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:28279 f(H') = Σv∈(H') f(v)+Σe∈(H') f(e) form an arithmetic progression with the initial term a and the common difference d. When f(V) = {1, 2,...,⏐V⏐}, then G is said to be super (a, d)-H-antimagic. In this paper, we study super (a, d)-H-antimagic labellings of a disjoint union of graphs for d = ⏐E(H)⏐ - ⏐V(H)⏐.]]> Sat 24 Mar 2018 07:41:22 AEDT ]]> Antimagic labelings of join graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:28280 m,n is an example of join graphs and we give an antimagic labeling for Km,n,n≥2m+1. In this paper we also provide constructions of antimagic labelings of some complete multipartite graphs.]]> Sat 24 Mar 2018 07:41:22 AEDT ]]> Wheels are cycle-antimagic https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:26506 Sat 24 Mar 2018 07:35:33 AEDT ]]> Constructions of H-antimagic graphs using smaller edge-antimagic graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:34916 antimagic labeling of G admitting an H-covering is a bijective function f : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} such that, for all subgraphs H' of G isomorphic to H, the H'-weights, etf(H') = Συ∈V(H')f(υ)+Σe∈E(H')F(e), constitute an arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if f(V) = {1, 2, ..., ∣V∣}. In this paper, we study the existence of super (a, d)-H-antimagic labelings for graph operation GH, where G is a (super) (b, d*)-edge-antimagic total graph and H is a connected graph of order at least 3.]]> Fri 06 Oct 2023 15:46:50 AEDT ]]>